Exploiting the Error Correction Mechanism in QR Codes for Secret Sharing
نویسندگان
چکیده
This paper investigates a novel approach to secret sharing using QR codes. The proposed QR code secret sharing approach exploits the error correction mechanism inherent in the QR code structure, to distribute and encode information about a secret message in a number of shares. Each share in the scheme is constructed from a cover QR code, and each share itself is a valid QR code which can be scanned and decoded by a QR code reader. The secret message can be recovered by combining the information contained in the QR code shares. Since each share is a valid QR code, the proposed scheme has the advantage of reducing the likelihood of attracting the attention of potential attackers. In addition, the shares can be distributed via public channels without raising suspicion. Moreover, shares do not have to be stored or transmitted electronically, as QR codes can be distributed via printed media.
منابع مشابه
A Novel Visual Secret Sharing Scheme Based on QR Codes
Inthispaper,anovelvisualsecretsharing(VSS)schemeusingQRcodesisinvestigated.Theproposed visualsecretsharingschemebasedonQRcodes(VSSQR)canvisuallyrevealsecretimagebystacking sufficient(shadowimages)sharesaswellasscantheQRcodebyaQRcodereader.OurVSSQR exploitstheerrorcorrectionmechanismintheQRcodestructure,toembedthebitscorresponding ...
متن کاملAlgebraic geometry codes: general theory
World Scientific Review Volume-9in x 6in duursma-copy3 This chapter describes some of the basic properties of geometric Goppa codes, including relations to other families of codes, bounds for the parameters , and sufficient conditions for efficient error correction. Special attention is given to recent results on two-point codes from Hermitian curves and to applications for secret sharing.
متن کاملQuantum Secret Sharing with error correction
We investigate in this work a quantum error correction on a fivequbits graph state used for secret sharing through five noisy channels. We describe the procedure for the five, seven and nine qubits codes. It is known that the three codes always allow error recovery if only one among the sents qubits is disturbed in the transmitting channel. However, if two qubits and more are disturbed, then th...
متن کاملLinear Multisecret-Sharing Schemes and Error-Correcting Codes
In this paper a characterization of the general relation between linear multisecret-sharing schemes and error-correcting codes is presented. A bridge between linear multisecret-sharing threshold schemes and maximum distance separable codes is set up. The information hierarchy of linear multisecret-sharing schemes is also established. By making use of the bridge several linear multisecret-sharin...
متن کاملQuantum secret sharing with noisy channels
This paper is devoted to quantum error correction for secret sharing with a ve qubits graph state through ve noisy channels. The correction procedure is described for the ve, seven and nine qubits codes. These three codes are similar if one among the sent qubits is infected by an error in the transmission channel. However, If two qubits are infected, then the correction result changes from o...
متن کامل